Cluster Based Real Time Scheduling for Distributed System

Real time tasks scheduling on a distributed system is complex problem. The existing real techniques are primarily based partitioned and global scheduling. In the assigned dedicated processor. advantages of approach uni-processor can be used; no migration overheads but task assignment NP hard problem optimal utilization processing nodes not possible. all maintained in single queue allocated to multiple nodes. advantage suffer from high preemption overheads. This paper proposed cluster which hybrid where group into using simulation result shows that increases acceptance ratio, resource as compared reduces well